Stationary remaining service time conditional on queue length
نویسندگان
چکیده
In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary remaining service time in a FIFO M/G/1 queue, conditional on the number of customers in the system being equal to j, j ≥ 1. Fakinos (1982) derived a similar formula using an alternative method. Here we give a short proof of the formula using rate conservation law (RCL), and generalize to handle higher moments which better illustrates the advantages of using RCL.
منابع مشابه
Some invariance properties of monotone failure rate in the M/G/1 queue
We show that in the stationary M/G/1 queue, if the service time distribution is with increasing (decreasing) failure rate (IFR (DFR)), then (a) The distribution of the number of customers in the system is also IFR (DFR), (b) The conditional distribution of the remaining service time given the number of customers in the system is also IFR (DFR) and (c) The conditional distribution of the remaini...
متن کاملSecond Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A queueing system (M/G1,G2/1/ ) is considered in which the service time of a customer entering service depends on whether the queue length, , is above or below a threshold . The arrival process is Poisson and the general service times 1 and 2 depend on whether the queue length at the time service is initiated is or , respectively. Balance equations are given for the stationary probabilities of ...
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007